Scalable Frames
نویسندگان
چکیده
Tight frames can be characterized as those frames which possess optimal numerical stability properties. In this paper, we consider the question of modifying a general frame to generate a tight frame by rescaling its frame vectors; a process which can also be regarded as perfect preconditioning of a frame by a diagonal operator. A frame is called scalable, if such a diagonal operator exists. We derive various characterizations of scalable frames, thereby including the infinite-dimensional situation. Finally, we provide a geometric interpretation of scalability in terms of conical surfaces.
منابع مشابه
Scalable Frames and Convex Geometry
The recently introduced and characterized scalable frames can be considered as those frames which allow for perfect preconditioning in the sense that the frame vectors can be rescaled to yield a tight frame. In this paper we define m-scalability, a refinement of scalability based on the number of nonzero weights used in the rescaling process, and study the connection between this notion and ele...
متن کاملPreconditioning techniques in frame theory and probabilistic frames
These notes have a dual goal. On the one hand we shall give an overview of the recently introduced class of scalable frames. These are (finite) frames with the property that each frame vector can be rescaled in such a way that the resulting frames are tight. This process can be viewed as a preconditioning method for finite frames. In particular, we shall: (1) describe the class of scalable fram...
متن کاملBipredictive Video Super-Resolution Using Key-frames
Many scalable video coding systems use variable resolution frames to enable different decoding layers. Some of these systems also use frame down-sampling along with enhancement layers to reduce complexity. In order to do that, super-resolution methods associated with efficient interpolation processes may help to increase the quality of low-resolution frames. This work presents a super-resolutio...
متن کاملScalable Multiresolution Video Coding using Subband Decomposition
A subband approach to scalable multiresolution video coding is presented. In a first step of experiments this scheme is applied to the coding of I–frames, where bit rate savings up to 21.1% compared with MPEG–2 spatial scalability are achieved. In a next step it will be used for inter–frame coding of P– and B–frames.
متن کاملNonlinear Structural Hashing for Scalable Video Search
In this paper, we propose a nonlinear structural hashing (NSH) approach to learn compact binary codes for scalable video search. Unlike most existing video hashing methods which consider image frames within a video separately for binary code learning, we develop a multi-layer neural network to learn compact and discriminative binary codes by exploiting both the structural information between di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1204.1880 شماره
صفحات -
تاریخ انتشار 2012